package com.zfl;

public class Rob {

    public int rob(int[] nums) {
        if (nums.length==1) {
            return nums[0];
        }


        int n = nums.length;
        int[] dp = new int[n];

        dp[0] = nums[0];
        dp[1] = Math.max(nums[0],nums[1]);

        if (nums.length==2) {
            return dp[1];
        }

        for (int i = 2; i < n; i++) {
            dp[i] = Math.max(dp[i-1],dp[i-2]+nums[i]);
        }

        return dp[n-1];
    }
}
